Regular Temporal Cost Functions
نویسندگان
چکیده
منابع مشابه
Linear temporal logic for regular cost functions
Regular cost functions have been introduced recently as an extension to the notion of regular languages with counting capabilities, which retains strong closure, equivalence, and decidability properties. The specificity of cost functions is that exact values are not considered, but only estimated. In this paper, we define an extension of Linear Temporal Logic (LTL) over finite words to describe...
متن کاملThe Bridge Between Regular Cost Functions and Omega-Regular Languages
In this paper, we exhibit a one-to-one correspondence between ω-regular languages and a subclass of regular cost functions over finite words, called ω-regular like cost functions. This bridge between the two models allows one to readily import classical results such as the last appearance record or the McNaughton-Safra constructions to the realm of regular cost functions. In combination with ga...
متن کاملVarieties of Cost Functions
Regular cost functions were introduced as a quantitative generalisation of regular languages, retaining many of their equivalent characterisations and decidability properties. For instance, stabilisation monoids play the same role for cost functions as monoids do for regular languages. The purpose of this article is to further extend this algebraic approach by generalizing two results on regula...
متن کاملPartial second-order subdifferentials of -prox-regular functions
Although prox-regular functions in general are nonconvex, they possess properties that one would expect to find in convex or lowerC2 functions. The class of prox-regular functions covers all convex functions, lower C2 functions and strongly amenable functions. At first, these functions have been identified in finite dimension using proximal subdifferential. Then, the definition of prox-regula...
متن کاملSafra-like constructions for regular cost functions over finite words
Regular cost functions have been introduced recently as an extension of the notion of regular languages with counting capabilities, which retains strong closure, equivalence, and decidability properties. Cost functions are functions ranging over N∪{∞}, and considered modulo an equivalence which preserves the existence of bounds over each subset of the domain. A central result in the theory of r...
متن کامل